CNF and DNF succinct graph encodings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Succinct Encodings of Graph Isomorphism

It is well known that problems encoded with circuits or formulas generally gain an exponential complexity blow-up compared to their original

متن کامل

On Converting CNF to DNF

We study how big the blow-up in size can be when one switches between the CNF and DNF representations of boolean functions. For a function f : {0, 1}n → {0, 1}, cnfsize(f) denotes the minimum number of clauses in a CNF for f ; similarly, dnfsize(f) denotes the minimum number of terms in a DNF for f . For 0 ≤ m ≤ 2n−1, let dnfsize(m, n) be the maximum dnfsize(f) for a function f : {0, 1}n → {0, ...

متن کامل

Backpropagation for Neural Dnf{ and Cnf{networks

The architecture of a neural network with its links and weights can be viewed as a knowledge representation. To overcome the black{box problem of not knowing what knowledge is hidden in a neural architecture, we present a strictly logically operating network. Each neuron represents either a disjunc-tion or conjunction of its inputs and the net thus performs the function of a logic formula. This...

متن کامل

Towards Robust CNF Encodings of Cardinality Constraints

Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are the different SAT encodings for ≤ 1 (x1, . . . , xn) constraints. The most widely used encoding is known as the pairwise encoding, which is quadratic in the number of variables in the constraint. Alternative encodings ar...

متن کامل

A Relationship Between CNF and DNF Systems Derivable from Examples

In learning from examples, the main goal is to use a collection of positive examples and a collection of negative examples to derive a Boolean expression which satisfies the requirements imposed by the examples. In order to represent such a Boolean expression, the conjunctive normal form (CNF) and the disjunctive normal form (DNF) have been proposed. This paper makes two contributions. First it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2017

ISSN: 0890-5401

DOI: 10.1016/j.ic.2016.06.009